A Plasticity Principle of Convex Quadrilaterals on a Convex Surface of Bounded Specific Curvature
نویسندگان
چکیده
منابع مشابه
Convex tours of bounded curvature
We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with m vertices, containing an obstacle in a form of a simple polygon with n vertices. We present an O(m + n) time algorithm finding the path, going around the obstacle, whose curvature is the smallest po...
متن کاملConvex Hulls of Bounded Curvature
In this paper, we consider the problem of computing a convex hull of bounded curvature of a set S of points in the plane, i.e. a set containing S and whose boundary is a curve of bounded curvature of minimal length. We prove that, if the radius of the smallest disk that contains S is greater than 1, such a hull is unique. We show that the computation of a convex hull of bounded curvature reduce...
متن کاملReachability by paths of bounded curvature in a convex polygon
Let B be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most one, and let P be a convex polygon with n vertices. Given a starting configuration (a location and a direction of travel) for B inside P , we characterize the region of all points of P that can be reached by B, and show that it has complexity O(n). We give an O(n) time algorithm to co...
متن کاملToric Geometry of Convex Quadrilaterals
We provide an explicit resolution of the Abreu equation on convex labeled quadrilaterals. This confirms a conjecture of Donaldson in this particular case and implies a complete classification of the explicit toric Kähler– Einstein and toric Sasaki–Einstein metrics constructed in [6, 23, 14]. As a byproduct, we obtain a wealth of extremal toric (complex) orbi-surfaces, including Kähler–Einstein ...
متن کاملConvex Quadrilaterals and k-Sets
We prove that the minimum number of convex quadrilaterals determined by n points in general position in the plane – or in other words, the rectilinear crossing number of the complete graph Kn – is at least ( 38 + 10 −5) ( n 4 ) +O(n). Our main tool is a lower bound on the number of (≤ k)-sets of the point set: we show that for every k ≤ n/2, there are at least 3 ( k+1 2 ) subsets of size at mos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Applicandae Mathematicae
سال: 2013
ISSN: 0167-8019,1572-9036
DOI: 10.1007/s10440-013-9831-6